Ordered Groups with Greatest Common Divisors Theory
نویسنده
چکیده
An embedding (called a GCD theory) of partly ordered abelian group G into abelian l-group Γ is investigated such that any element of Γ is an infimum of a subset (possible non-finite) from G. It is proved that a GCD theory need not be unique. A complete GCD theory is introduced and it is proved that G admits a complete GCD theory if and only if it admits a GCD theory G Γ such that Γ is an Archimedean l-group. Finally, it is proved that a complete GCD theory is unique (up to o-isomorphisms) and that a po-group admits the complete GCD theory if and only if any v-ideal is v-invertible.
منابع مشابه
Generalized Greatest Common Divisors, Divisibility Sequences, and Vojta’s Conjecture for Blowups
We apply Vojta’s conjecture to blowups and deduce a number of deep statements regarding (generalized) greatest common divisors on varieties, in particular on projective space and on abelian varieties. Special cases of these statements generalize earlier results and conjectures. We also discuss the relationship between generalized greatest common divisors and the divisibility sequences attached ...
متن کاملDivisibility Theory and Complexity of Algorithms for Free Partially Commutative Groups
3.3. The greatest common divisor and the least common multiple 12 3.4. Parabolic divisors 14 3.5. Divisibility: further properties 14 4. Normal forms arising from HNN extensions 16 4.1. HNN -normal form 16 5. Conjugacy problem 18 5.1. Conjugacy Criterion for HNN -extensions 18 5.2. Block decomposition 22 5.3. Conjugacy with respect to a subgroup 23 5.4. An algorithm for solving the Conjugacy Pr...
متن کاملIntegral Cayley Graphs Defined by Greatest Common Divisors
An undirected graph is called integral, if all of its eigenvalues are integers. Let Γ = Zm1 ⊗· · ·⊗Zmr be an abelian group represented as the direct product of cyclic groups Zmi of order mi such that all greatest common divisors gcd(mi,mj) ≤ 2 for i 6= j. We prove that a Cayley graph Cay(Γ, S) over Γ is integral, if and only if S ⊆ Γ belongs to the the Boolean algebra B(Γ) generated by the subg...
متن کاملA Jacobi Algorithm and Metric Theory for Greatest Common
Greatest common divisor algorithms are used to provide a natural motivation for considering a class of Jacobi-Perron algorithms which includes the original Jacobi algorithm. This work proves convergence and establishes metric properties for one of these algorithms. The proofs generalize to the larger class of algorithms. Full connections with the calculation of greatest common divisors will be ...
متن کاملInvolutions, Humbert Surfaces, and Divisors on a Moduli Space
Let M2 be the Igusa compactification of the Siegel modular variety of degree 2 and level 2. In earlier work with R. Lee, we carefully investigated this variety. Subvarieties Dl (compactification divisors) and H∆ (Humbert surface of discriminant 1) play a prominent role in its structure; in particular their fundamental classes span H4(M2;Z). We return to this variety and consider another class o...
متن کامل